Fibred Coalgebraic Logic and Quantum Protocols
نویسندگان
چکیده
منابع مشابه
Fibred Coalgebraic Logic and Quantum Protocols
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions on different fibres. As this fibred setting will typically involve multiple signature functors, the logic incorporates a calculus of modalities enabling the c...
متن کاملThe Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this paper, the least (fibre-wise) of such liftings, L(B), is characterized for essentially any B. The lifting has all the useful properties of the relation lifting due to Jacobs, without the usual assumption of weak pullback ...
متن کاملQuantum Field Theory and Coalgebraic Logic in Theoretical Computer Science
We suggest that in the framework of the Category Theory it is possible to demonstrate the mathematical and logical dual equivalence between the category of the q-deformed Hopf Coalgebras and the category of the q-deformed Hopf Algebras in quantum field theory (QFT), interpreted as a thermal field theory. Each pair algebra-coalgebra characterizes a QFT system and its mirroring thermal bath, resp...
متن کاملCoalgebraic Logic
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that innnitary modal logic contains characterizing formulas. That is, every model-world pair is characterized up to bisimulation by an innnitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangm...
متن کاملClassical Logic = Fibred MLL
Syntactically, classical logic decomposes thus [Gir87]: Classical logic = MLL + Superposition where MLL is Multiplicative Linear Logic, and superposition means contraction (binary case) and weakening (nullary case). Proof nets for classical logic have been proposed [Gir91, Rob03], containing explicit contraction and weakening nodes. Just as the logical sequent rules of conjuction (tensor) and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.171.9